منابع مشابه
On Privacy and Partition Arguments
A function and f (x1, x2, . . . , xn) is said to be t-private if there exists a (randomized) communication protocol for computing f , such that no coalition of at most t participants can infer any additional information from the execution of the protocol other than what follows from their inputs and the value of f . It is known that every n-argument function f defined over finite domains can be...
متن کاملPartition epistemology and arguments from analogy
Nineteenth and twentieth century philosophies of science have consistently failed to identify any rational basis for the compelling character of scientific analogies. This failure is particularly worrisome in light of the fact that the development and diffusion of certain scientific analogies, e.g. Darwin’s analogy between domestic breeds and naturally occurring species, constitute paradigm cas...
متن کاملPartition Arguments in Multiparty Communication Complexity
Consider the “Number in Hand” multiparty communication complexity model, where k players holding inputs x1, . . . , xk ∈ {0, 1} communicate to compute the value f(x1, . . . , xk) of a function f known to all of them. The main lower bound technique for the communication complexity of such problems is that of partition arguments: partition the k players into two disjoint sets of players and find ...
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملon semihypergroups and hypergroups
in this thesis, first the notion of weak mutual associativity (w.m.a.) and the necessary and sufficient condition for a $(l,gamma)$-associated hypersemigroup $(h, ast)$ derived from some family of $lesssim$-preordered semigroups to be a hypergroup, are given. second, by proving the fact that the concrete categories, semihypergroups and hypergroups have not free objects we will introduce t...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2001
ISSN: 0890-5401
DOI: 10.1006/inco.2000.3013